Convolution, Correlation and Uncertainty Principle in the One-Dimensional Quaternion Quadratic-Phase Fourier Transform Domain
نویسندگان
چکیده
In this paper, we present a novel integral transform known as the one-dimensional quaternion quadratic-phase Fourier (1D-QQPFT). We first define (1D-QQPFT) of integrable (and square integrable) functions on R. Later on, show that 1D-QQPFT satisfies all respective properties such inversion formula, linearity, Moyal’s convolution theorem, correlation theorem and uncertainty principle. Moreover, use proposed to obtain an formula for two-dimensional transform. Finally, highlight our paper with some possible applications.
منابع مشابه
An uncertainty principle for quaternion Fourier transform
We review the quaternionic Fourier transform (QFT). Using the properties of the QFT we establish an uncertainty principle for the right-sided QFT. This uncertainty principle prescribes a lower bound on the product of the effective widths of quaternion-valued signals in the spatial and frequency domains. It is shown that only a Gaussian quaternion signal minimizes the uncertainty.
متن کاملRelationships between Convolution and Correlation for Fourier Transform and Quaternion Fourier Transform
In this paper we introduce convolution theorem for the Fourier transform (FT) of two complex functions. We show that the correlation theorem for the FT can be derived using properties of convolution. We develop this idea to derive the correlation theorem for the quaternion Fourier transform (QFT) of the two quaternion functions.
متن کاملEfficient implementation of quaternion Fourier transform, convolution, and correlation by 2-D complex FFT
The recently developed concepts of quaternion Fourier transform (QFT), quaternion convolution (QCV), and quaternion correlation, which are based on quaternion algebra, have been found to be useful for color image processing. However, the necessary computational algorithms and their complexity still need some attention. In this paper, we will develop efficient algorithms for QFT, QCV, and quater...
متن کاملFast Convolution and Fast Fourier Transform under Interval Uncertainty
Convolution y(t) = ∫ a(t − s) · x(s) ds is one of the main techniques in digital signal processing. A straightforward computation of the convolution y(t) requires O(n) steps, where n is the number of observations x(t0), . . . , x(tn−1). It is well known that by using the Fast Fourier Transform (FFT) algorithm, we can compute convolution much faster, with computation time O(n · log(n)). In pract...
متن کاملJoint Fourier transform correlation with phase thresholding in the Fourier domain
Howard E. Michel Abdul Ahad S. Awwal, MEMBER SPIE Wright State University Computer Science and Engineering Department Dayton, Ohio 45435 E-mail: [email protected] Abstract. A new implementation of the joint Fourier transform correlation (JFTC) utilizing the phase information in the Fourier plane is proposed. When a phase-based thresholding scheme is used on the joint Fourier spectrum, the co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2023
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math11133002